Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing
نویسندگان
چکیده
منابع مشابه
Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing
Giving user a simple and uncomplicated web search result representation is an active area of Information Retrieval research. Traditional search engines use the hyperlink structure of the web to retrieve documents or pages and give them in a ranked fashion to the user. In this paper, we propose a technique for grouping web search results into meaningful clusters. The proposed method performs heu...
متن کاملWeb Search Result Clustering based on Heuristic Search and k-means
Giving user a simple and well organized web search result has been a topic of active information Retrieval (IR) research. Irrespective of how small or ambiguous a query is, a user always wants the desired result on the first display of an IR system. Clustering of an IR system’s result can render a way, which fulfills the user’s actual information need. In this paper, an approach to cluster an I...
متن کاملImproving Web Search Results Using Semantic Clustering
This paper consider the problem of search engine that are not capable of retrieving appropriate result on query given. Most of the users are not able to give the appropriate query to get what exactly they wanted to retrieve. So the search engine retrieves a massive list of data, which are ranked by the page rank algorithm or relevancy algorithm or human judgment algorithm. If the relevant resul...
متن کاملClustering of Web Search Results Using Semantic
Clustering is related to data mining for information retrieval. Relevant information is retrieved quickly while doing the clustering of documents. It organizes the documents into groups; each group contains the documents of similar type content. Different clustering algorithms are used for clustering the documents such as partitioned clustering (K-means Clustering) and Hierarchical Clustering (...
متن کاملWeb Page Clustering Using Heuristic Search in the Web Graph
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search results into groups (clusters), one for each meaning of the query. These groups are usually constructed according to the topical similarity of the retrieved documents, but it is possible for documents to be totally dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/6342-8633